Optimum, Stable, and Fair Flow Control for Packet Networks

نویسنده

  • Hideki SATOH
چکیده

The author proposes a flow control scheme which derives the optimal packet transmission rate from the ACKs of the sending packets. The optimization is based on mathematical programming such as the extremal method and leastsquares method. The author proves that the proposed method is fair when the RTT and thepacket length of each sender are the same. It is also shown that the sufficient condition for the proposed method to be optimal and stable generally holds true in packet networks. The performances are examined by computer simulations, and it is found that high throughput is obtained regardless of the network structure. key words: optimization, stability, fairness, extremal method,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable Flow Control Coding in Low-Buffer Grid Networks

We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...

متن کامل

A control-theoretical approach for achieving fair bandwidth allocations in core-stateless networks

In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on the Scalable Core (SCORE) / Dynamic Packet State (DPS) architecture. In particular, we make use of the Linear Quadratic control method from optimal control theory to design stable and robust systems that are simple to implement. Simulation results show that this approach gives ...

متن کامل

Reliable Flow Control Coding in Low-Buffer Grid Networks

We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...

متن کامل

UN CO RR EC TE D PR OO F 2 A control - theoretical approach for achieving fair bandwidth 3 allocations in core - stateless networks 4

9 In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on 10 the scalable core (SCORE)/dynamic packet state (DPS) architecture. In particular, we make use of the linear quadratic 11 control method from optimal control theory to design stable and robust systems that are simple to implement. Sim12 ulation results show that this approa...

متن کامل

Flow-Level Stability of Wireless Networks: Separation of Congestion Control and Packet Scheduling

It is by now well-known that wireless networks with file arrivals and departures are stable if one uses αfair congestion control and back-pressure based scheduling and routing. In this paper, we examine whether α-fair congestion control is necessary for flow-level stability. We show that stability can be ensured even with very simple congestion control mechanisms, such as a fixed window size sc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999